Binary matroids that classify forests

نویسندگان

چکیده

Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Removable Circuits in Binary Matroids

We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minor, then M has a circuit C such that M ? C is connected and r(M ? C) = r(M).

متن کامل

A construction for binary matroids

A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a binary matroid. Its circuits are the minimal members of this collection. We use this basic property to derive binary matroids from binary matroids. In particular, we derive two matroids from graphic and cographic matroids. Cocycles of the first one are cutsets or balancing...

متن کامل

Involutions Of Connected Binary Matroids

We prove that if an involution φ is an automorphism of a connected binary matroid M , then there is a hyperplane of M that is invariant under φ. We also consider extensions of this result for higher connectivity.

متن کامل

Optimal Matching Forests and Valuated Delta-Matroids

The matching forest problem in mixed graphs is a common generalization of the matching problem in undirected graphs and the branching problem in directed graphs. Giles presented an O(nm)-time algorithm for finding a maximum-weight matching forest, where n is the number of vertices and m is that of edges, and a linear system describing the matching forest polytope. Later, Schrijver proved total ...

متن کامل

The asymptotic number of binary codes and binary matroids

The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra and discrete mathematics

سال: 2022

ISSN: ['1726-3255', '2415-721X']

DOI: https://doi.org/10.12958/adm1759